| Definitions | E(X), chain-consistent(f;chain), s = t,  A,  b, sys-antecedent(es;Sys), x:A  B(x),  x:A. B(x), P   Q, t  T, ES, EState(T), a:A fp B(a), f(a), Id,  , strong-subtype(A;B), Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e',  , constant_function(f;A;B), SWellFounded(R(x;y)),  , pred!(e;e'),   x,y. t(x;y), !Void(),  x:A.B(x), Top, S  T, suptype(S; T), first(e), <a, b>, pred(e), x.A(x), x. t(x), P & Q, E, AbsInterface(A), e  X, {x:A| B(x)} , e c e',  x:A. B(x), P  Q, a < b, hd(l), L1 L2, e loc e' , adjacent(T;L;x;y), (x l), no_repeats(T;l), let x,y = A in B(x;y), t.1, loc(e), Atom$n, ff, inr x , tt, inl x , False, True, case b of inl(x) => s(x) | inr(y) => t(y), X(e), if b then t else f fi , (e <loc e'), e(e1,e2].P(e), @e(x v), (last change to x before e), A c B, pred(e), (e < e'), P  Q, P Q, lastchange(x;e), es-init(es;e), a = b, prior(X), x dom(f), locl(a), ||as||, #$n, Dec(P), e<e'.P(e), ee'.P(e), e<e'. P(e), ee'.P(e), e[e1,e2).P(e), e[e1,e2).P(e), e[e1,e2].P(e), e[e1,e2].P(e), e(e1,e2].P(e),  T, b | a, a ~ b, a b, a <p b, a < b, x f y, xL. P(x), (xL.P(x)), y is f*(x), r < s, q-rel(r;x), Outcome, l_disjoint(T;l1;l2), SqStable(P), a =!x:T. Q(x), InvFuns(A;B;f;g), Inj(A;B;f), IsEqFun(T;eq), Refl(T;x,y.E(x;y)), Sym(T;x,y.E(x;y)), Trans(T;x,y.E(x;y)), AntiSym(T;x,y.R(x;y)), Connex(T;x,y.R(x;y)), CoPrime(a,b), Ident(T;op;id), Assoc(T;op), Comm(T;op), Inverse(T;op;id;inv), BiLinear(T;pl;tm), IsBilinear(A;B;C;+a;+b;+c;f), IsAction(A;x;e;S;f), Dist1op2opLR(A;1op;2op), fun_thru_1op(A;B;opa;opb;f), FunThru2op(A;B;opa;opb;f), Cancel(T;S;op), monot(T;x,y.R(x;y);f), IsMonoid(T;op;id), IsGroup(T;op;id;inv), IsMonHom{M1,M2}(f), a b, IsIntegDom(r), IsPrimeIdeal(R;P), f g, {i..j } |
